Verifying probabilistic system with EpCTL
نویسندگان
چکیده
A temporal logic for reasoning about probabilistic systems is considered exogenous probabilistic computation tree logic (EpCTL). Both a syntactic and a semantic approach to verify systems with EpCTL are introduced. For the first approach a (weakly) complete Hilbert calculus is given. The completeness result capitalizes in the decidability of the existential theory of the real numbers and in a PSPACE SAT algorithm for the state logic. For the model checking approach, the semantics is simplified to (probabilistic) Kripke structures where probability distributions are modeled with floating point arrays. In this case, the model-checking algorithm turns up to be polynomial in the size of the model. The results are illustrated with a simple asynchronous probabilistic programming language where some examples are specified and analyzed.
منابع مشابه
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evolution is modelled by probabilistic Kripke structures that capture both stochastic and non–deterministic transitions. The proposed logic is a temporal enrichment of Exogenous Probabilistic Propositional Logic (EPPL). Th...
متن کاملBlack-box probabilistic verification
We explore the concept of a “black-box” stochastic system, and propose an algorithm for verifying probabilistic properties of such systems based on very weak assumptions regarding system dynamics. The properties are expressed using a variation of PCTL, the Probabilistic Computation Tree Logic. We present a general model of stochastic discrete event systems, which encompasses both discrete-time ...
متن کاملVerifying Weak Probabilistic Noninterference
Weak probabilistic noninterference is a security property for enforcing confidentiality in multi-threaded programs. It aims to guarantee secure flow of information in the program and ensure that sensitive information does not leak to attackers. In this paper, the problem of verifying weak probabilistic noninterference by leveraging formal methods, in particular algorithmic verification, is disc...
متن کاملProbabilistic Model Checking for Systems Biology
Probabilistic model checking is a technique for formally verifying quantitative properties of systems that exhibit stochastic behaviour. In this chapter, we show how this approach can be applied to the study of biological systems such as biochemical reaction networks and signalling pathways. We present an introduction to the state-of-the-art probabilistic model checking tool PRISM using a case ...
متن کاملVerifying Linear Duration Properties of Probabilistic Real-time Systems
In this paper we present a method for deciding whether a probabilistic real-time system, modelled as a Markov chain, satisses a linear duration property at a given time interval with a given lower bound of the probability. With this method we can reduce the problem into a nite number of integer linear constraint systems, which have been well studied can be solved with a polynomial-time algorithm.
متن کامل